Combining Contrast Invariant L1 Data Fidelities with Nonlinear Spectral Image Decomposition
نویسندگان
چکیده
This paper focuses on multi-scale approaches for variational methods and corresponding gradient flows. Recently, for convex regularization functionals such as total variation, new theory and algorithms for nonlinear eigenvalue problems via nonlinear spectral decompositions have been developed. Those methods open new directions for advanced image filtering. However, for an effective use in image segmentation and shape decomposition, a clear interpretation of the spectral response regarding size and intensity scales is needed but lacking in current approaches. In this context, L data fidelities are particularly helpful due to their interesting multi-scale properties such as contrast invariance. Hence, the novelty of this work is the combination of L-based multiscale methods with nonlinear spectral decompositions. We compare L with L scale-space methods in view of spectral image representation and decomposition. We show that the contrast invariant multi-scale behavior of L − TV promotes sparsity in the spectral response providing more informative decompositions. We provide a numerical method and analyze synthetic and biomedical images at which decomposition leads to improved segmentation.
منابع مشابه
Spectral-spatial classification of hyperspectral images by combining hierarchical and marker-based Minimum Spanning Forest algorithms
Many researches have demonstrated that the spatial information can play an important role in the classification of hyperspectral imagery. This study proposes a modified spectral–spatial classification approach for improving the spectral–spatial classification of hyperspectral images. In the proposed method ten spatial/texture features, using mean, standard deviation, contrast, homogeneity, corr...
متن کاملKernel Spectral Clustering and applications
In this chapter we review the main literature related to kernel spectral clustering (KSC), an approach to clustering cast within a kernel-based optimization setting. KSC represents a least-squares support vector machine based formulation of spectral clustering described by a weighted kernel PCA objective. Just as in the classifier case, the binary clustering model is expressed by a hyperplane i...
متن کاملLearning Koopman Invariant Subspaces for Dynamic Mode Decomposition
Spectral decomposition of the Koopman operator is attracting attention as a tool for the analysis of nonlinear dynamical systems. Dynamic mode decomposition is a popular numerical algorithm for Koopman spectral analysis; however, we often need to prepare nonlinear observables manually according to the underlying dynamics, which is not always possible since we may not have any a priori knowledge...
متن کاملNonlinear filtering by threshold decomposition
A new threshold decomposition architecture is introduced to implement stack filters. The architecture is also generalized to a new class of nonlinear filters known as threshold decomposition (TD) filters which are shown to be equivalent to the class of L1-filters under certain conditions. Another new class of filters known as linear and order statistic (LOS) filters result from the intersection...
متن کاملA new algorithm for solving Van der Pol equation based on piecewise spectral Adomian decomposition method
In this article, a new method is introduced to give approximate solution to Van der Pol equation. The proposed method is based on the combination of two different methods, the spectral Adomian decomposition method (SADM) and piecewise method, called the piecewise Adomian decomposition method (PSADM). The numerical results obtained from the proposed method show that this method is an...
متن کامل